//2009/08/16 21:44:05
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <algorithm>

using namespace std;

class SMS
{
public:
    string compress(string original)
    {
		string s; s.clear();
		for(int i=0; i<original.size(); i++)
		{
			if(isvowels(original[i]))
			{
				bool left=false, right=false;
				for(int j=i-1; j>=0&&original[j]!=' '; j--) if(!isvowels(original[j])) left = true;
				for(int j=i+1; j<original.size()&&original[j]!=' '; j++ ) if(!isvowels(original[j])) right = true;
				if(left && right) continue;
			}
			s += original[i];
		}
		return s;
    }
	private:
	bool isvowels(char c)
	{
		return (c=='A' || c=='E'||c=='I'||c=='O'||c=='U'||c=='a'||c=='e'||c=='i'||c=='o'||c=='u');
	}
};
